Normal forms for binary relations

نویسندگان

  • Daniel J. Dougherty
  • Claudio Gutiérrez
چکیده

We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads to a computational interpretation of the representable theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal Forms and Reduction for Theories of Binary Relations

We consider equational theories of binary relations, in a language expressing composition, converse, and lattice operations. We treat the equations valid in the standard model of sets and also define a hierarchy of equational axiomatisations stratifying the standard theory. By working directly with a presentation of relation-expressions as graphs we are able to define a notion of reduction whic...

متن کامل

Design Methodology for Relational Databases: Issues Related to Ternary Relationships in Entity-relationship Model and Higher Normal Forms

Entity-Relationship (ER) modeling plays a major role in relational database design. The data requirements are conceptualized using an ER model and then transformed to relations. If the requirements are well understood by the designer and then if the ER model is modeled and transformed to relations, the resultant relations will be normalized. However the choice of modeling relationships between ...

متن کامل

On the Quantifier-Free Dynamic Complexity of Reachability

The dynamic complexity of the reachability query is studied in the dynamic complexity framework of Patnaik and Immerman, restricted to quantifier-free update formulas. It is shown that, with this restriction, the reachability query cannot be dynamically maintained, neither with binary auxiliary relations nor with unary auxiliary functions, and that ternary auxiliary relations are more powerful ...

متن کامل

Relations among Dirichlet Series Whose Coefficients Are Class Numbers of Binary Cubic Forms Ii

As a continuation of the authors’ and Wakatsuki’s previous paper [5], we study relations among Dirichlet series whose coefficients are class numbers of binary cubic forms. We show that, for all integral models of the space of binary cubic forms, the associated Dirichlet series satisfy self dual identities.

متن کامل

Fuzzy number-valued fuzzy ‎relation

It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 360  شماره 

صفحات  -

تاریخ انتشار 2006